A nearly optimal deterministic parallel Voronoi diagram algorithm
نویسندگان
چکیده
منابع مشابه
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon
The geodesic Voronoi diagram ofm point sites inside a simple polygon of n vertices is a subdivision of the polygon into m cells, one to each site, such that all points in a cell share the same nearest site under the geodesic distance. The best known lower bound for the construction time is Ω(n+m logm), and a matching upper bound is a long-standing open question. The state-of-theart construction...
متن کاملA Theoretical Study of Parallel Voronoi Diagram
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log n) parallel algorithm for computing Voronoi diagram on the Euclidean plane. Our technique parallelizes the wellknown seemingly inherent sequential technique of Shamos and Hoey, and makes use of a number of special properties of the div...
متن کاملCommunication-eecient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram ?
In this paper we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP-like models of computation, where p processors, with O(n p) O(1) local memory each, communicate through some arbitrary interconnection network. They are communication-eecient since they require, respectively, O(1)...
متن کاملCommunication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram
In this paper we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP-like models of computation, where p processors, with O(~) ~> O(1) local memory each, communicate through some arbitrary interconnection network. They axe communication-efficient since they require, respectively, O...
متن کاملAn L1 Voronoi Diagram Algorithm for a Reconfigurable Mesh
In this paper we introduce an algorithm for computing the Voronoi Diagram using the L1 metric for n planar points on the reconfigurable mesh model of computation. The algorithm contains a new technique of embedding aplanar graph on the mesh using the reconfigurable nature of the architecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1996
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01944352